• TPLP regular papers
• Transactions On Computational Logic (TOCL) regular papers

• Design and Implementation of Aggregate Functions in the DLV System, Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'Armi, Giuseppe Ielpa

• Design and Implementation of a Tracer Driver: Easy and Efficient Dynamic Analyses of Constraint Logic Programs, Ludovic Langevine and Mireille Ducass\'e

• Checking the Quality of Medical Guidelines using Automated Reasoning Tools, Arjen Hommersom, Peter Lucas and Patrick van Bommel

• Logic Programming with Social Features for Multi-Agent Systems,
  Francesco Buccafurri and Gianluca Caminiti

• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs,
  Matti Järvisalo, Emilia Oikarinen

• Achieving Compositionality of the Stable Model Semantics for Smodels Programs ,
  Emilia Oikarinen and Tomi Janhunen

Regular Papers

• Justifications for Logic Programs under Answer Set Semantics. ,
  Enrico Pontelli, Tran Cao Son, and Omar Elkhatib

• Probabilistic reasoning with answer sets ,
  Chitta Baral, Michael Gelfond and Nelson Rushton

Accepted Regular Papers

• A Non-Termination Criterion for Binary Constraint Logic Programs ,
  Etienne Payet and Fred Mesnard

• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities ,
  Leslie De Koninck

• On finitely recursive programs ,
  Sabrina Baselice, Piero A. Bonatti, Giovanni Criscuolo

The files below are the final versions of the papers submitted by the authors. The definite, published versions of the papers are available from the TOCL home page within the ACM Digital Library.

• Complexity Results for Security Protocols with Diffie-Hellman Exponentiation and Commuting Public Key Encryption Yannick Chevalier, Ralf Kuesters, Michael Rusinowitch and Mathieu Turuani
• Undecidability of the Unification and Admissibility Problems for Modal and Description Logics Frank Wolter and Michael Zakharyaschev
• Open Answer Set Programming with Guarded Programs Stijn Heymans, Davy Van Nieuwenborgh and Dirk Vermeir
• Reasoning with Recursive Loops under the PLP Framework Yi-Dong Shen
• Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying Helmut Seidl and Kumar Neeraj Verma
• Verifiable Agent Interaction in Abductive Logic Programming: the SCIFF Framework Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello and Paolo Torroni

• Specifying Norm-Governed Computational Societies Alexander Artikis, Marek Sergot and Jeremy Pitt
• Arithmetic Complexity Lou van den Dries and Yiannis N. Moschovakis
• Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data Neil Yorke-Smith and Carmen Gervet
• New Results on Rewrite-based Satisfiability Procedures Alessandro Armando, Maria Paola Bonacina, Silvio Ranise and Stephan Schulz
• Reasoning about Actions with Sensing under Qualitative and Probabilistic Uncertainty Luca Iocchi, Thomas Lukasiewicz, Daniele Nardi and Riccardo Rosati
• A Finite Equational Base for CCS with Left Merge and Communication Merge Luca Aceto, Wan Fokkink, Anna Ingolfsdottir and Bas Luttik
• Logical Characterization of the Counting Hierarchy Juha Kontinen

• The Geometry of Linear Higher-Order Recursion Ugo Dal Lago
• Probabilistic Bisimulation as a Congruence Ruggero Lanotte and Simone Tini
• Termination of Rewriting Strategies: a Generic Approach Isabelle Gnaedig and Hélène Kirchner (Electronic Appendix)
• A Compositional Semantics for CHR Maurizio Gabrielli and Maria Chiara Meo
• Proofs, Tests and Continuation Passing Style Stefano Guerrini and Andrea Masini
• PSPACE Bounds for Rank-1 Modal Logics Lutz Schröder and Dirk Pattinson
• On the Proof Complexity of Deep Inference Paola Bruscoli and Alessio Guglielmi

• Checking Timed Büchi Automata Emptiness on Simulation Graphs Stavros Tripakis
• LTL with the Freeze Quantifier and Register Automata Stéphane Demri and Ranko Lazic
• Generalizing Consistency and other Constraint Properties to Quantified Constraints Lucas Bordeaux, Marco Cadoli and Toni Mancini (Electronic Appendix)
• Analytic Tableaux Calculi for KLM Logics of Nonmonotonic Reasoning Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca Pozzato (Electronic Appendix)
• An Algebra of Quantum Processes Mingsheng Ying, Yuan Feng, Runyao Duan and Zhengfeng Ji (Electronic Appendix)
• Simultaneous Checking of Completeness and Ground Confluence for Algebraic Specifications Adel Bouhoula
• Tableau Calculus for Preference-Based Conditional Logics: CE and Its Extensions Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Camilla Schwind
• Differential Recursion Akitoshi Kawamura

• Editorial Patrick Baillot, Jean-Yves Marion and Simona Ronchi Della Rocca
• A New Function Algebra of EXPTIME Functions by Safe Nested Recursion Toshiyasu Arai and Naohi Eguchi
• Context Semantics, Linear Logic and Computational Complexity Ugo Dal Lago
• Extending the LOOP language with Higher-Order Procedural Variables T. Crolard, E. Polonowski and P. Valarcher
• Sup-Interpretations, a Semantic Method for Static Analysis of Program Resources Jean-Yves Marion and Romain Péchoux
• A Flow Calculus of mwp-Bounds for Complexity Analysis Neil D. Jones and Lars Kristiansen
• Resource Control Graphs Jean-Yves Moyen

• Finitary Winning in Omega-Regular Games Krishnendu Chatterjee, Thomas A. Henzinger and Florian Horn
• Automated Termination Proofs for Logic Programs by Term Rewriting P. Schneider-Kamp, J. Giesl, A. Serebrenik and R. Thiemann
• Tableau-Based Decision Procedures for Logics of Strategic Ability in Multiagent Systems Valentin Goranko and Dmitry Shkatov
• Regular Tree Languages Definable in FO and FOmod Michael Benedikt and Luc Segoufin
• The Formal System lambda-delta Ferruccio Guidi
• Higher-Order Term Indexing Using Substitution Trees Brigitte Pientka (Electronic Appendix)
• A General Framework for Sound and Complete Floyd-Hoare Logics Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva
• Logical Queries over Views: Decidability and Expressiveness James Bailey, Guozhu Dong, Anthony Widjaja To
• Deciding Security Properties for Cryptographic Protocols. Application to Key Cycles Hubert Comon-Lundh, Véronique Cortier, Eugen Zălinescu
• Annotated RDF Octavian Udrea, Diego Reforgiato Recupero and V.S. Subrahmanian
• Weyl's Predicative Classical Mathematics as a Logic-Enriched Type Theory Robin Adams and Zhaohui Luo
• Undecidability and Intractability Results Concerning Datalog Programs and their Persistency Numbers Stavros Cosmadakis, Eugenie Foustoucos and Anastasios Sidiropoulos
• Proof Search Specifications of Bisimulation and Modal Logics for the pi-calculus Alwen Tiu and Dale Miller (Electronic Appendix)